binary search constructive algorithms math *800

Please click on ads to support us..

Python Code:

row = input()
def smaller(a,b):
    if a>b:
        return b
    else:
        return a
for i in range(int(row)):
    row_col = input().split(' ')
    coder = int(row_col[0])
    mather = int(row_col[1])
    max = smaller((coder+mather)//4,smaller(coder,mather))
    print(max)



Comments

Submit
0 Comments
More Questions

432A - Choosing Teams
758A - Holiday Of Equality
1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game
1560C - Infinity Table
1605C - Dominant Character
1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter
796A - Buying A House
67A - Partial Teacher
116A - Tram
1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=